منابع مشابه
Resource allocation with time intervals
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and induces a given profit. We aim to select a subset of jobs with maximal total profit such that the total resource consumed at any point in time remains bounded by the given resource capacity. While this case is trivially NP...
متن کاملReal-Time Hierarchical Resource Allocation
This paper presents a model that distinguishes between decentralized information processing and decentralized decision making in organizations; it shows that decentralized decision making can be advantageous due to computational delay, even in the absence of communication costs. The key feature of the model, which makes this result possible, is that decisions in a stochastic control problem are...
متن کاملOPTIMAL RESOURCE ALLOCATION IN DEA WITH INTEGER VARIABLES
Resource allocation and optimal leveling are among the top challenges in project management. This paper presents a DEA-based procedure for determining an optimal level of inputs to produce a fixed level of outputs. To achieve this goal, we assume that the levels of outputs can be forecasted in the next season and the procedure will determine optimal level of inputs for all DMUs. Such as some of...
متن کاملReal-Time Hierarchical Resource Allocation with Quadratic Payoffs
This paper presents a model in which resource allocations are calculated in real time by boundedly rational members of an administrative staff. We consider a class of hierarchical procedures in which information about payoff functions flows up and is aggregated by a hierarchy, while allocations flow down and are disaggregated by the hierarchy with decentralized decision making. We assume that t...
متن کاملResource Allocation in OFDMA Wireless Networks with Time-Varying Arrivals
This paper considers the issue of optimal subcarrier allocation in OFDMA wireless networks when the arrivals and channels are stochastic and time-varying. Our objective is to minimize the long-term average packet delay over multiple time epochs. We show by an example that water-filling-based subcarrier allocation policy which maximizes throughput at each time epoch is not optimal in this case. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.08.028